Accurate and efficient matrix exponential computation
نویسندگان
چکیده
منابع مشابه
Solution of Troesch's problem through double exponential Sinc-Galerkin method
Sinc-Galerkin method based upon double exponential transformation for solving Troesch's problem was given in this study. Properties of the Sinc-Galerkin approach were utilized to reduce the solution of nonlinear two-point boundary value problem to same nonlinear algebraic equations, also, the matrix form of the nonlinear algebraic equations was obtained.The error bound of the method was found. ...
متن کاملEfficient Computation of the Matrix Exponential by Generalized Polar Decompositions
Abstract. In this paper we explore the computation of the matrix exponential in a manner that is consistent with Lie-group structure. Our point of departure is the method of generalized polar decompositions, which we modify and combine with similarity transformations that bring the underlying matrix to a form more amenable to efficient computation. We develop techniques valid for a range of Lie...
متن کاملCalculation of One-dimensional Forward Modelling of Helicopter-borne Electromagnetic Data and a Sensitivity Matrix Using Fast Hankel Transforms
The helicopter-borne electromagnetic (HEM) frequency-domain exploration method is an airborne electromagnetic (AEM) technique that is widely used for vast and rough areas for resistivity imaging. The vast amount of digitized data flowing from the HEM method requires an efficient and accurate inversion algorithm. Generally, the inverse modelling of HEM data in the first step requires a precise a...
متن کاملExponential Expansion for Rapid and Accurate Extraction of Interconnect Capacitance
We report a new approach for efficient computation of capacitance in multiconductor systems embedded in homogeneous or multiple dielectric media. The technique employs exponential expansion of the Green's function for evaluation of the three-dimensional potential and its gradient, enabling rapid and accurate extraction of interconnect capacitance in VLSI and large-area amorphous silicon electro...
متن کاملAn Efficient Bound for the Condition Number of the Matrix Exponential
A new bound for the condition number of the matrix exponential is presented. Using the bound, we propose an efficient approximation to the condition number, denoted by κg(s,X), that avoids the computation of the Fréchet derivative of the matrix exponential that underlies condition number estimation in the existing algorithms. We exploit the identity eX = (eX/2 s )2 s for a nonnegative integer s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Math.
دوره 91 شماره
صفحات -
تاریخ انتشار 2014